Approximating Residual Sets by Strongly Residual Sets
نویسندگان
چکیده
منابع مشابه
Effectively approximating measurable sets by open sets
We answer a recent question of Bienvenu, Muchnik, Shen, and Vereshchagin. In particular, we prove an effective version of the standard fact from analysis which says that, for any ε > 0 and any Lebesgue-measurable subset of Cantor space, X ⊆ 2, there is an open set Uε ⊆ 2, Uε ⊇ X, such that μ(Uε) ≤ μ(X) + ε, where μ(Z) denotes the Lebesgue measure of Z ⊆ 2. More specifically, our main result sho...
متن کاملIrregular Sets for Ratios of Birkhoff Averages Are Residual
It follows from Birkhoff’s Ergodic Theorem that the irregular set of points for which the Birkhoff averages of a given continuous function diverge has zero measure with respect to any finite invariant measure. In strong contrast, for systems with the weak specification property, we show here that if the irregular set is nonempty, then it is residual. This includes topologically transitive topol...
متن کاملApproximating Extended Answer Sets
We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, while satisfied by a “perfect” solution, may be left unsatisfied in an approximate extended answer set. Approximations improve as the number of unsatisfied constraints decreases. We show how the framework can also capture the class...
متن کاملZero sets in pointfree topology and strongly $z$-ideals
In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...
متن کاملApproximating Minimum Feedback Sets
This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (fvs) problem, and the weighted feedback edge set problem (fes). In the fvs (resp. fes) problem, one is given a directed graph with weights on the ver-tices (resp. edges), and is asked to nd a subset of vertices (resp. edges) with minimum total weight that int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1970
ISSN: 0002-9939
DOI: 10.2307/2036743